//裴波那契数列的迭代实现

#include <iostream>
using namespace std;
int main(void)
{

    int a[40];

    a[0] = 0;
    a[1] = 1;

    cout << "0 " << a[0] << endl;
    cout << "1 " << a[1] << endl;
    for(int i = 2; i < 40; i++)
    {
        a[i] = a[i - 1] + a[i - 2];
        cout << i <<" "<< a[i] << endl;
    }
    cout << "hello world" << endl;
    return 0;
}